Fast filtering for RNA homology search
نویسندگان
چکیده
منابع مشابه
Fast filtering for RNA homology search
MOTIVATION Homology search for RNAs can use secondary structure information to increase power by modeling base pairs, as in covariance models, but the resulting computational costs are high. Typical acceleration strategies rely on at least one filtering stage using sequence-only search. RESULTS Here we present the multi-segment CYK (MSCYK) filter, which implements a heuristic of ungapped stru...
متن کاملEffective Query Filtering for Fast Homology Searching
To improve the accuracy of rapid homology searching it is common practice to filter all queries to mask low complexity regions prior to searching. We show in this paper, through a large-scale study of querying the PIR database, that applying popular filtering techniques unselectively to all queries may reduce retrieval effectiveness. We also show that masking queries with our new technique, caf...
متن کاملAdaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملFast Homology Search using Categorisation Profiles
Homology search is an important step in discovering evolutionary relationships in modern molecular biology. In particular, it is key to analysing data from large-scale sequencing initiatives: by establishing homology between a newly-discovered sequence and well-understood sequences in curated repositories, it is possible to infer structure and function without the need for costly, time-consumin...
متن کاملClustering Near-Identical Sequences for Fast Homology Search
We present a new approach to managing redundancy in sequence databanks such as GenBank. We store clusters of near-identical sequences as a representative union-sequence and a set of corresponding edits to that sequence. During search, the query is compared to only the union-sequences representing each cluster; cluster members are then only reconstructed and aligned if the union-sequence achieve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2011
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btr545